Cluster Based Personalized Search WAW 2009
نویسندگان
چکیده
We study personalized web ranking algorithms based on the existence of document clusterings. Motivated by the topic sensitive page ranking of Haveliwala [20], we develop and implement an efficient “local-cluster” algorithm by extending the web search algorithm of Achlioptas et al. [10]. We propose some formal criteria for evaluating such personalized ranking algorithms and provide some preliminary experiments in support of our analysis. Both theoretically and experimentally, our algorithm differs significantly from Topc Sensitive Page Rank.
منابع مشابه
Cluster Based Personalized Search
We study personalized web ranking algorithms based on the existence of document clusterings. Motivated by the topic sensitive page ranking of Haveliwala [20], we develop and implement an efficient “local-cluster” algorithm by extending the web search algorithm of Achlioptas et al. [10]. We propose some formal criteria for evaluating such personalized ranking algorithms and provide some prelimin...
متن کاملCriteria for Cluster-Based Personalized Search
We study personalized web ranking algorithms based on the existence of document clusterings. Motivated by the topic sensitive page ranking of Haveliwala [20], we develop and implement an efficient “local-cluster” algorithm by extending the web search algorithm of Achlioptas, Fiat, Karlin and McSherry [10]. We propose some formal criteria for evaluating such personalized ranking algorithms and p...
متن کاملEnhancing Web Search through Query Log Mining
INTRODUCTION Web query log is a type of file keeping track of the activities of the users who are utilizing a search engine. Compared to traditional information retrieval setting in which documents are the only information source available, query logs are an additional information source in the Web search setting. Based on query logs, a set of Web mining techniques, such as log-based query clus...
متن کاملDynamical Clustering of Personalized Web Search Results
Most current search engines present the user a ranked list given the submitted user query. Top ranked search results generally cover few aspects of all search results. However, in many cases, the users are interested in the main themes of search results besides the ranked list so that the user will have a global view of search results. This goal is often achieved through clustering approaches. ...
متن کاملA personalised query suggestion agent based on query-concept bipartite graphs and Concept Relation Trees
Queries submitted to a Web search engine are usually short and ambiguous. Currently, most search engines respond to a user’s query by using the bag-of-words model, which matches keywords between the query and Web documents but ignores contexts and users’ preferences. Thus, many irrelevant results are returned by the conventional search engines. Query suggestion is a way for extending queries to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008